Homogeneous multivariate polynomials with the half-plane property
نویسندگان
چکیده
منابع مشابه
A criterion for the half-plane property
We establish a convenient necessary and sufficient condition for a multiaffine real polynomial to be stable, and use it to verify that the half-plane property holds for seven small matroids that resisted the efforts of Choe, Oxley, Sokal, and Wagner [5]. In recent years, matroid theory has found connections with certain analytic properties of real multivariate polynomials. These properties are ...
متن کاملDiscrete Concavity and the Half-Plane Property
Murota et al. have recently developed a theory of discrete convex analysis which concerns M -convex and L-convex functions on jump systems. We introduce here a family of M -concave functions arising naturally from polynomials (over the field of Puiseux series) with prescribed non-vanishing properties. This family contains several of the most studied M -concave functions in the literature. We al...
متن کاملAn Introduction to Upper Half Plane Polynomials
For example, x1 + · · · + xd ∈ Ud (C). This follows from the fact that the upper half plane is a cone, so if σ1, . . . , σd are in the upper half plane then so is their sum. Another example is x1x2 − 1. If σ1 and σ2 are in the upper half plane then σ1σ2 ∈ C \ (0,∞), so σ1σ2 − 1 is not zero. U1 (C) is easily described. It is all polynomials in one variable whose roots are either real, or lie in ...
متن کاملProperties of Multivariate Homogeneous Orthogonal Polynomials
It is well-known that the denominators of Pade approximants can be considered as orthogonal polynomials with respect to a linear functional. This is usually shown by defining Pade -type approximants from so-called generating polynomials and then improving the order of approximation by imposing orthogonality conditions on the generating polynomials. In the multivariate case, a similar constructi...
متن کاملMinimizing Cubic and Homogeneous Polynomials over Integers in the Plane
We complete the complexity classification by degree of minimizing a polynomial in two variables over the integer points in a polyhedron. Previous work shows that in two variables, optimizing a quadratic polynomial over the integer points in a polyhedral region can be done in polynomial time, while optimizing a quartic polynomial in the same type of region is NP-hard. We close the gap by showing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2004
ISSN: 0196-8858
DOI: 10.1016/s0196-8858(03)00078-2